Supporting Open and Closed World Reasoning on the Web
نویسندگان
چکیده
In this paper general mechanisms and syntactic restrictions are explored in order to specify and merge rule bases in the Semantic Web. Rule bases are expressed by extended logic programs having two forms of negation, namely strong (or explicit) and weak (also known as default negation or negation-as-failure). The proposed mechanisms are defined by very simple modular program transformations, and integrate both open and closed world reasoning. These program transformations are shown to be appropriate for the two major semantics for extended logic programs: answer set semantics and well-founded semantics with explicit negation. Moreover, the results obtained by both semantics are compared.
منابع مشابه
Closed World Reasoning in the Semantic Web through Epistemic Operators
The open world assumption makes OWL principally suitable to handle incomplete knowledge in Semantic Web scenarios, however, some scenarios desire closed world reasoning. Autoepistemic description logics allow to realise closed world reasoning in open world settings through epistemic operators. An extension of OWL by epistemic operators therefore allows for non-monotonic features known from clos...
متن کاملImplementing Simple Modular ERDF ontologies
The Extended Resource Description Framework has been proposed to equip RDF graphs with weak and strong negation, as well as derivation rules, increasing the expressiveness of ordinary RDF graphs. In parallel, the Modular Web framework enables collaborative and controlled reasoning in the Semantic Web. In this paper we show how to use the Modular Web Framework to capture the modular semantics fo...
متن کاملMatching Semantic Service Descriptions with Local Closed-World Reasoning
Semantic Web Services were developed with the goal of automating the integration of business processes on the Web. The main idea is to express the functionality of the services explicitly, using semantic annotations. Such annotations can, for example, be used for service discovery—the task of locating a service capable of fulfilling a business request. In this paper, we present a framework for ...
متن کاملClosed World Reasoning for OWL2 with Negation As Failure
The Description Logic (DL)-based ontologies impose the Open World Assumption (OWA), while many other knowledge formalisms, such as the Logic Program, relational database, etc. impose the ClosedWorld Assumption (CWA). In order to interoperate knowledge bases and systems with these different representations, as well as to support applications in certain domains with complete knowledge, it is nece...
متن کاملLogic Programs with Contextually Scoped Negation
The Semantic Web community is currently dominated by knowledge representation formalisms adhering to a strict open world assumption. Nonmonotonic reasoning formalisms are viewed with partial scepticism and it is often argued that nonmonotonic reasoning techniques which adopt a closed world assumption are invalid in an open environment such as the Web where knowledge is notoriously incomplete. N...
متن کامل